Boolean models and infinitary first order languages
نویسندگان
چکیده
منابع مشابه
Locally Boolean Domains and Universal Models for Infinitary Sequential Languages
In the first part of this Thesis we develop the theory of locally boolean domains and bistable maps (as introduced in [Lai05b]) and show that the category of locally boolean domains and bistable maps is equivalent to the category of Curien-Lamarche games and observably sequential functions (cf. [CCF94]). Further we show that the category of locally boolean domains has inverse limits of ω-chains...
متن کاملFirst-order definable languages
We give an essentially self-contained presentation of some principal results for first-order definable languages over finite and infinite words. We introduce the notion of a counter-free Büchi automaton; and we relate counter-freeness to aperiodicity and to the notion of very weak alternation. We also show that aperiodicity of a regular ∞-language can be decided in polynomial space, if the lang...
متن کاملFirst-Order Proofs for Higher-Order Languages
We study the use of the-calculus for semantical descriptions of higher-order concurrent languages with state. As an example, we choose Concurrent Idealized ALGOL (CIA). CIA is particularly interesting as, yet being a core language, it combines imperative and parallel features with a procedural mechanism of full higher order. It can thus be used as a formal model for concurrent programs as, e.g....
متن کاملFirst Order Languages: Further Syntax and Semantics1
Third of a series of articles laying down the bases for classical first order model theory. Interpretation of a language in a universe set. Evaluation of a term in a universe. Truth evaluation of an atomic formula. Reassigning the value of a symbol in a given interpretation. Syntax and semantics of a non atomic formula are then defined concurrently (this point is explained in [16], 4.2.1). As a...
متن کاملFirst-Order Functional Languages and Intensional Logic
The purpose of this paper is to demonstrate that first-order functional programs can be transformed into intensional programs of nullary variables, in a semantics preserving way. On the foundational side, the goal of our study is to bring new insights and a better understanding of the nature of functional languages. From a practical point of view, our investigation provides a formal basis for t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematical Logic
سال: 1973
ISSN: 0003-4843
DOI: 10.1016/0003-4843(73)90003-x